Iterative pushdown automata and hyperbolic contour words
نویسنده
چکیده
In this paper, we give an application of iterated pushdown automata to contour words of balls and two other domains in infinitely many tilings of the hyperbolic plane. We also give a similar application for the tiling {5, 3, 4} of the hyperbolic 3D space and for the tiling {5, 3, 3, 4} of the hyperbolic 4D space as well. keywords: pushdown automata, iterated pushdown automata, tilings, hyperbolic plane, tessellations ACM-class: F.2.2., F.4.1, I.3.5
منابع مشابه
Fibonacci words, hyperbolic tilings and grossone
In this paper, we study the contribution of the theory of grossone to the study of infinite Fibonacci words, combining this tool with the help of a particular tiling of the hyperbolic plane : the tiling {7, 3}, called the heptagrid. With the help of the numeral system based on grossone, we obtain a richer family of infinite Fibonacci words compared with the traditional approach. ACM-class: F.2....
متن کاملOn the Expressive Power of 2-Stack Visibly Pushdown Automata
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre, Madhusudan, and Parlato, who exploit the concept of visibility further to obtain a rich pushdown-automata cla...
متن کاملRamsey-Based Inclusion Checking for Dense-Stack Visibly Pushdown Automata
Visibly pushdown automata are popular as they are closed under Boolean operations and determinization. There exist multiple notions of timed pushdown systems like recursive timed automata, densetime pushdown automata. We explore a generalization of visibly pushdown automata over infinite words with parity acceptance condition –in which stack elements have real valued time stamps–named dense-sta...
متن کاملOn Büchi One-Counter Automata
Equivalence of deterministic pushdown automata is a famous problem in theoretical computer science whose decidability has been shown by Sénizergues. Our first result shows that decidability no longer holds when moving from finite words to infinite words. This solves an open problem that has recently been raised by Löding. In fact, we show that already the equivalence problem for deterministic B...
متن کاملRegularity Problems for Weak Pushdown ω-Automata and Games
We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words. Furthermore, we consider the problem of deciding for pushdown games whether a winning stra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0907.4957 شماره
صفحات -
تاریخ انتشار 2009